Algorithms for computing strategies in two-player simultaneous move games
نویسندگان
چکیده
منابع مشابه
Algorithms for computing strategies in two-player simultaneous move games
Simultaneous move games model discrete, multistage interactions where at each stage players simultaneously choose their actions. At each stage, a player does not know what action the other player will take, but otherwise knows the full state of the game. This formalism has been used to express games in general game playing and can also model many discrete approximations of real-world scenarios....
متن کاملComputing Uniformly Optimal Strategies in Two-Player Stochastic Games
We provide a computable algorithm to calculate uniform ε-optimal strategies in two-player zero-sum stochastic games. Our approach can be used to construct algorithms that calculate uniform ε-equilibria and uniform correlated ε-equilibria in various classes of multi-player non-zero-sum stochastic games. JEL codes: C63, C73.
متن کاملPlayer Modeling, Search Algorithms and Strategies in Multi-player Games
For a long period of time, two person zero-sum games have been in the focus of researchers of various communities. The efforts were mainly driven by the fascination of special competitions like Deep Blue vs. Kasparov, and of the beauty of parlor games like Checkers, Backgammon, Othello and Go. Multi-player games, however, have been inspected by far less, and although literature of game theory f...
متن کاملAdditional Winning Strategies in Two-Player Games
We study the problem of checking whether a two-player reachability game admits more than a winning strategy. We investigate this in case of perfect and imperfect information, and, by means of an automata approach we provide a linear-time procedure and an exponential-time procedure, respectively. In both cases, the results are tight.
متن کاملAlgorithms for uniform optimal strategies in two-player zero-sum stochastic games with perfect information
In stochastic games with perfect information, in each state at most one player has more than one action available. We propose two algorithms which find the uniform optimal strategies for zero-sum two-player stochastic games with perfect information. Such strategies are optimal for the long term average criterion as well. We prove the convergence for one algorithm, which presents a higher comple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2016
ISSN: 0004-3702
DOI: 10.1016/j.artint.2016.03.005